Cut-norm and entropy minimization over weak⁎ limits
نویسندگان
چکیده
منابع مشابه
Solving the Graph Cut Problem via l1 Norm Minimization
Graph cuts have become an increasingly important tool for solving a number of energy minimization problems in computer vision and other fields. In this paper, the graph cut problem is reformulated as an unconstrained l1 norm minimization. This l1 norm minimization can then be tackled by solving a sequence of sparse linear systems involving the Laplacian of the underlying graph. The proposed pro...
متن کاملAnalyzing the Weighted Nuclear Norm Minimization and Nuclear Norm Minimization based on Group Sparse Representation
Nuclear norm minimization (NNM) tends to over-shrink the rank components and treats the different rank components equally, thus limits its capability and flexibility. Recent studies have shown that the weighted nuclear norm minimization (WNNM) is expected to be more accurate than NNM. However, it still lacks a plausible mathematical explanation why WNNM is more accurate than NNM. This paper ana...
متن کاملConsistency of Trace Norm Minimization
Regularization by the sum of singular values, also referred to as the trace norm, is a popular technique for estimating low rank rectangular matrices. In this paper, we extend some of the consistency results of the Lasso to provide necessary and sufficient conditions for rank consistency of trace norm minimization with the square loss. We also provide an adaptive version that is rank consistent...
متن کاملControl Using Atomic Norm Minimization
It has been shown that the H2 distributed control problem subject to quadratically invariant delay constraints admits a finite dimensional solution. When these delay constraints are induced by a strongly connected communication graph, this problem can be solved by decomposing the controller into a centralized but delayed component, and a distributed finite impulse response component, the latter...
متن کاملSafe Weak Minimization Revisited
Minimization operators of different strength have been studied in the framework of “predicative (safe) recursion”. In this paper a modification of these operators is presented. By adding the new operator to those used by Bellantoni-Cook and Leivant to characterize the polynomial-time computable functions one obtains a characterization of the nondeterministic polynomial-time computable multifunc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2019
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2018.12.010